Weighted automata: model checking and games
نویسنده
چکیده
1 Weighted automata 1 1.1 Definitions . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 2 1.2 Shortest and longest paths . . . . . . . . . . . . . . . . . . . . . . 2 1.3 Optimal mean payoff . . . . . . . . . . . . . . . . . . . . . . . . . 6 1.4 Weighted temporal logics . . . . . . . . . . . . . . . . . . . . . . 9 1.5 Energy constraints . . . . . . . . . . . . . . . . . . . . . . . . . . 16
منابع مشابه
Weighted Timed Automata: Model-Checking and Games
In this paper, we present weighted/priced timed automata, an extension of timed automaton with costs, and solve several interesting problems on that model.
متن کاملModel Checking Real-Time Systems
This chapter surveys timed automata as a formalism for model checking real-time systems. We begin with introducing the model, as an extension of finite-state automata with real-valued variables for measuring time. We then present the main model-checking results in this framework, and give a hint about some recent extensions (namely weighted timed automata and timed games).
متن کاملWeighted Automata on Infinite Words in the Context of Attacker-Defender Games
The paper is devoted to several infinite-state Attacker-Defender games with reachability objectives. We prove the undecidability of checking for the existence of a winning strategy in several low-dimensional mathematical games including vector reachability games, word games and braid games. To prove these results, we consider a model of weighted automata operating on infinite words and prove th...
متن کاملOne Clock Priced Timed Automata: Model Checking and Optimal Strategies
In this paper, we consider priced (or weighted) timed automata, and prove various decidability results when the automaton has only one clock: we prove that model checking of WCTL is decidable and that optimal costs in priced timed games are computable. In contrast, it has recently been proved that these problems are undecidable for this model as soon as the system has three clocks.
متن کاملWeighted O-Minimal Hybrid Systems Are More Decidable Than Weighted Timed Automata!
We consider weighted o-minimal hybrid systems, which extend classical o-minimal hybrid systems with cost functions. These cost functions are “observer variables” which increase while the system evolves but do not constrain the behaviour of the system. In this paper, we prove two main results: (i) optimal o-minimal hybrid games are decidable; (ii) the model-checking of WCTL, an extension of CTL ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008